منابع مشابه
Game Semantics for Bounded Polymorphism
We describe a denotational, intensional semantics for programs with polymorphic types with bounded quantification, in which phenomena such as inheritance between stateful objects may be represented and studied. Our model is developed from a game semantics for unbounded polymorphism, by establishing dinaturality properties of generic strategies, and using them to give a new construction for inte...
متن کاملCTL with Finitely Bounded Semantics
We consider a variation of the branching time logic CTL with non-standard, “finitely bounded” semantics (FBS). FBS is naturally defined as game-theoretic semantics where the proponent of truth of an eventuality must commit to a time limit (number of transition steps) within which the formula should become true on all (resp. some) paths starting from the state where the formula is evaluated. The...
متن کاملBounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. More specifically, we translate the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability. We consider three semantics: process, step, and interleaving semantics. We show t...
متن کاملResource-bounded inference with three-valued neighborhood semantics
The traditional view in epistemic logic says that agents see all logical consequences of the information they have, but this would give agents capabilities far beyond what humans display or what is physically realizable. A theory that aims to specify behavior for intelligent agents should provide more realistic guidelines for what reasoning is expected from the agents. To work towards developin...
متن کاملAn operational semantics of a timely bounded agent abstract machine
This paper presents a domain speci c programming language dedicated to timely bounded agents. Timely bounded agents are expected to deliver the most appropriate response to a stimuli and this response has to be delivered at the right time, otherwise it is ignored. This modi es assumptions and action models used in most of current agent programming languages and frameworks. We propose a domain s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.026